Digital computation of the complex linear canonical transform
نویسندگان
چکیده
منابع مشابه
Digital computation of the complex linear canonical transform.
An efficient algorithm for the accurate computation of the linear canonical transform with complex transform parameters and with complex output variable is presented. Sampling issues are discussed and the requirements for different cases given. Simulations are provided to validate the results.
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملEigenfunctions of linear canonical transform
The linear canonical transform (the LCT) is a useful tool for optical system analysis and signal processing. It is parameterized by a 2 2 matrix . Many operations, such as the Fourier transform (FT), fractional Fourier transform (FRFT), Fresnel transform, and scaling operations are all the special cases of the LCT. In this paper, we will discuss the eigenfunctions of the LCT. The eigenfunctions...
متن کاملDigital computation of the fractional Fourier transform
An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N , the presented algorithm computes the fractional transform in O( N log N ) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Optical Society of America A
سال: 2011
ISSN: 1084-7529,1520-8532
DOI: 10.1364/josaa.28.001379